منابع مشابه
Teorie informace
Př́ıklad 1.1 (provozováńı loterie). V loterii bude . = 500 000 los̊u po 4 $, z nichž 1 vyhraje 1 M$. Certifikované losovaćı zař́ızeńı s 500 000 výsledky neńı. (Např. ruleta o pr̊uměru 1 km.) Losy oč́ıslujeme a necháme nezávisle vylosovat č́ıslice. Problém: Kolik máme zaplatit za vylosováńı č́ıslic? (1. č́ıslice má jen 5 stejně pravděpodobných hodnot.) Řešeńı: Podle hry věťśı-menš́ı vylosujeme 19 nezávis...
متن کاملA binding rule for government-binding parsing
In this paper I propose a Binding rule for the identification of pronoun and anaphor referents in phrase-structure trees, assuming the general framework of lhe Government-binding theory outlined by Chom,;ky (1981). The Binding rule, specified by means of an attribute grammar, is a particular instantiation of the Free Indexing rule and binding axioms in Chomsky's Binding theory, with certain emp...
متن کاملWhat if Chomsky were right?
The outcome of scientific research depends on how a phenomenon is viewed and how the questions are phrased. This applies also to the nativist view of language acquisition. As a complement to MacWhinney’s discussion of nativism from the viewpoint of cognitive psychology, I would like to devote this commentary to the question of the title from the viewpoint of computational linguistics. Formally,...
متن کاملReflection in the Chomsky Hierarchy
The class of regular languages can be generated from the regular expressions. These regular expressions, however, do not themselves form a regular language, as can be seen using the pumping lemma. On the other hand, the class of enumerable languages can be enumerated by a universal language that is one of its elements. We say that the enumerable languages are reflexive. In this paper we investi...
متن کاملTowards a Coalgebraic Chomsky Hierarchy
The Chomsky hierarchy plays a prominent role in the foundations of theoretical computer science relating classes of formal languages of primary importance as well as the grammars and machine models that represent those language classes. It is well-known that regular languages can be captured by coalgebras. They form precisely the image of all finite coalgebras for the set functor X 7→ 2×X under...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stellenbosch Papers in Linguistics Plus
سال: 2013
ISSN: 2224-3380,1726-541X
DOI: 10.5842/9-0-594